Asymptotic analysis of a random walk with a history-dependent step length

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Asymptotic analysis of a random walk with a history-dependent step length.

We study an unbiased, discrete-time random walk on the nonnegative integers, with the origin absorbing, and a history-dependent step length. Letting y denote the maximum distance the walker has ever been from the origin, steps that do not change y have length v, while those that increase y (taking the walker to a site that has never been visited) have length n. The process serves as a simplifie...

متن کامل

A Random Walk with Exponential Travel Times

Consider the random walk among N places with N(N - 1)/2 transports. We attach an exponential random variable Xij to each transport between places Pi and Pj and take these random variables mutually independent. If transports are possible or impossible independently with probability p and 1-p, respectively, then we give a lower bound for the distribution function of the smallest path at point log...

متن کامل

Asymptotic properties of a bold random walk.

In a recent paper we proposed a non-Markovian random walk model with memory of the maximum distance ever reached from the starting point (home). The behavior of the walker is different from the simple symmetric random walk only when she is at this maximum distance, where, having the choice to move either farther or closer, she decides with different probabilities. If the probability of a forwar...

متن کامل

Asymptotic Behavior of a Random Walk with Interaction∗

We consider a simple one-dimensional random walk with the statistical weight of each sample path given by πβ(ω) = exp{−β ∑ 05i β0 the distribution of ωn is concentrated in the area {|ωn| > cn}, where c = c(β) > 0, and for β < 0 every sample pa...

متن کامل

a random walk with exponential travel times

consider the random walk among n places with n(n - 1)/2 transports. we attach an exponential random variable xij to each transport between places pi and pj and take these random variables mutually independent. if transports are possible or impossible independently with probability p and 1-p, respectively, then we give a lower bound for the distribution function of the smallest path at point log...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Physical Review E

سال: 2002

ISSN: 1063-651X,1095-3787

DOI: 10.1103/physreve.66.051102